منابع مشابه
Vertical perimeter versus horizontal perimeter
Given k ∈ N, the k’th discrete Heisenberg group, denoted H Z , is the group generated by the elements a1, b1, . . . , ak, bk, c, subject to the commutator relations [a1, b1] = . . . = [ak, bk] = c, while all the other pairs of elements from this generating set are required to commute, i.e., for every distinct i, j ∈ {1, . . . , k} we have [ai, aj ] = [bi, bj ] = [ai, bj ] = [ai, c] = [bi, c] = ...
متن کاملThe perimeter in site directed percolation. Mean perimeter expansions
2014 Exact expansions for susceptibility 2014 like mean perimeter series for directed percolation and extended mean size series are analysed, on two and three dimensional lattices. The critical threshold pc estimates are refined for the triangular and simple cubic lattices. On the square next-nearest-neighbour site problem pc is estimated as pc = 0.4965 ± 0.002. J. Physique 47 (1986) 943-946 JU...
متن کاملSemantics-Aware Perimeter Protection
Web services security is becoming a critical concern for any organization adopting the XML-based Web services approach to application integration. While many access control techniques for Web services are becoming available, several issues still need to be solved in order to correctly split the burden of securing Web services between the perimetral and the service level. In this paper, a techni...
متن کاملOf Minimal Perimeter
The square decomposition problem has applications in a number of areas such as bin packing of flexible objects of fixed area and circuit layout with minimum communication requirements. Our interest in the square decomposition problem arises from the following problem in parallel computation [1]. One wishes to compute a table of all values of a binary function f on the Cartesian product S x T, w...
متن کاملMinimum-perimeter enclosures
We give the first polynomial-time algorithm for the problem of finding a minimumperimeter k-gon that encloses a given n-gon. Our algorithm is based on a simple structural result, that an optimal k-gon has at least one “flush” edge with the ngon. This allows one to reduce the problem to computing the shortest k-link path in a simple polygon. As a by-product we observe that the minimum-perimeter ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: British Journal of Ophthalmology
سال: 1951
ISSN: 0007-1161
DOI: 10.1136/bjo.35.10.634